Sensitivity of robust vertex fitting algorithms
نویسندگان
چکیده
منابع مشابه
The robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملA New Robust Fitting Algorithm for Vertex Reconstruction in the Ceres Experiment
In this paper we report on the application of a robust approach based on a reweighted least squares method for the vertex reconstruction of the CERES/NA45 experiment at the CERN SPS for the case of 160 GeV/u Pb+Au collisions and compare its performance with the presently used algorithm based on the minimization of summed Gaussian weights. In the CERES/NA45 experiment a doublet of cylindrical si...
متن کاملRobust Fitting of Parametric Curves
We consider the problem of fitting a parametric curve to a given point cloud (e.g., measurement data). Least-squares approximation, i.e., minimization of the l2 norm of residuals (the Euclidean distances to the data points), is the most common approach. This is due to its computational simplicity [1]. However, in the case of data that is affected by noise or contains outliers, this is not alway...
متن کاملRobust and efficient density fitting.
In this paper we propose an iterative method for solving the inhomogeneous systems of linear equations associated with density fitting. The proposed method is based on a version of the conjugate gradient method that makes use of automatically built quasi-Newton preconditioners. The paper gives a detailed description of a parallel implementation of the new method. The computational performance o...
متن کاملRobust Designs For Fitting Linear
This paper considers linear models with misspeciication of the form f(x) = E(yjx) = P p j=1 j g j (x) + h(x), where h(x) is an unknown function. We assume that the true response function f comes from a reproducing kernel Hilbert space and the estimates of the parameters j are obtained by the standard least squares method. A sharp upper bound for the mean squared error is found in terms of the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Nuclear Science
سال: 2004
ISSN: 0018-9499
DOI: 10.1109/tns.2004.832296